Large semigroups of cellular automata
نویسنده
چکیده
In this article we consider semigroups of transformations of cellular automata which act on a fixed shift space. In particular, we are interested in two properties of these semigroups which relate to “largeness”. The first property is ID and the other property is maximal commutativity (MC). A semigroup has the ID property if the only infinite invariant closed set (with respect to the semigroup action) is the entire space. We shall consider two examples of semigroups: one is spanned by cellular automata transformations that represent multiplications by integers on the one-dimensional torus and the other one consists of all the cellular automata transformations which are linear (when the symbols set is the ring of integers mod n). It will be shown that the two properties of these semigroups depend on the number of symbols s. The multiplication semigroup is ID and MC if and only if s is not a power of prime. The linear semigroup over the mentioned ring is always MC but is ID if and only if s is prime. When the symbol set is endowed with a finite field structure (when possible) the linear semigroup is both ID and MC. In addition, we associate with each semigroup which acts on a one sided shift space a semigroup acting on a two sided shift space, and vice versa, in such a way that preserves the ID and the MC properties.
منابع مشابه
Large Semigroup of Cellular Automata
Abstract. In this article we consider semigroups of transformations of cellular automata which act on a fixed shift space. In particular, we are interested in two properties of these semigroups which relate to “largeness”. The first property is ID and the other property is maximal commutativity (MC). A semigroup has the ID property if the only infinite invariant closed set (with respect to the ...
متن کاملDesign of Optimized Quantum-dot Cellular Automata RS Flip Flops
Complementary metal-oxide semiconductor (CMOS) technology has been the industry standard to implement Very Large Scale Integrated (VLSI) devices for the last two decades. Due to the consequences of miniaturization of such devices (i.e. increasing switching speeds, increasing complexity and decreasing power consumption), it is essential to replace them with a new technology. Quantum-dot c...
متن کاملNovel Defect Terminolgy Beside Evaluation And Design Fault Tolerant Logic Gates In Quantum-Dot Cellular Automata
Quantum dot Cellular Automata (QCA) is one of the important nano-level technologies for implementation of both combinational and sequential systems. QCA have the potential to achieve low power dissipation and operate high speed at THZ frequencies. However large probability of occurrence fabrication defects in QCA, is a fundamental challenge to use this emerging technology. Because of these vari...
متن کاملGroups and Semigroups Defined by Colorings of Synchronizing Automata
In this paper we combine the algebraic properties of Mealy machines generating self-similar groups and the combinatorial properties of the corresponding deterministic finite automata (DFA). In particular, we relate bounded automata to finitely generated synchronizing automata and characterize finite automata groups in terms of nilpotency of the corresponding DFA. Moreover, we present a decidabl...
متن کاملFinite Aperiodic Semigroups with Commuting Idempotents and Generalizations
Among the most important and intensively studied classes of semigroups are finite semigroups, regular semigroups and inverse semigroups. Finite semigroups arise as syntactic semigroups of regular languages and as transition semigroups of finite automata. This connection has lead to a large and deep literature on classifying regular languages by means of algebraic properties of their correspondi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011